Automatic Proofs for Formulae Enumerating Proper Polycubes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Proofs for Formulae Enumerating Proper Polycubes

We develop a general framework for computing formulae enumerating polycubes of size n which are proper in n−k dimensions (spanning all n−k dimensions), for a fixed value of k. Besides the fundamental importance of knowing the number of these simple combinatorial objects, such formulae are central in the literature of statistical physics in the study of percolation processes and the collapse of ...

متن کامل

Enumerating Proofs of Positive Formulae

We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This method is complete in the sense that each normal proof-term of the formula is produced by some scheme generated by the grammar. As a corollary, we get a simi...

متن کامل

The Perimeter of Proper Polycubes

We derive formulas for the number of polycubes of size n and perimeter t that are proper in n − 1 and n − 2 dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We demonstrate this by computing the perimeter polynomial for n = 12 in arbitrary dimension d.

متن کامل

Formulae and Growth Rates of High-Dimensional Polycubes

A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimensional polycube spans all the d dimensions, that is, the convex hull of the centers of its cubes is d-dimensional. In this paper we prove rigorously some (previously conjectured) closed formulae for fixed (proper and im...

متن کامل

Proper n-Cell Polycubes in n - 3 Dimensions

A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d − 1)-dimensional faces. Enumeration of polycubes, and, in particular, specific types of polycubes, as well as computing the asymptotic growth rate of polycubes, is a popular problem in combinatorics and discrete geometry. This is also an important tool in statistical physics for co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2015

ISSN: 1571-0653

DOI: 10.1016/j.endm.2015.06.022